Solvable cases of permutation #owshop scheduling with dominating machines
نویسندگان
چکیده
In this paper we study the permutation #owshop scheduling problem with an increasing and decreasing series of dominating machines. The objective is to minimize one of the "ve regular performance criteria, namely, total weighted completion time, maximum lateness, maximum tardiness, number of tardy jobs and makespan. We establish that these "ve cases are solvable by presenting a polymonial-time solution algorithm for each case. ( 2000 Elsevier Science B.V. All rights reserved.
منابع مشابه
Robotic Owshop Scheduling Is Strongly Np-complete
We consider a robotic owshop model in which a single robot is responsible for the transportation of parts between machines and the amount of time that a part spends on a machine must be comprised in some prede ned interval. The objective is to nd a feasible schedule with minimal cycle time. Many researchers have proposed nonpolynomial solution methods for a variety of closely related robotic ow...
متن کاملEconomic Lot Sizing and Scheduling in Distributed Permutation Flow Shops
This paper addresses a new mixed integer nonlinear and linear mathematical programming economic lot sizing and scheduling problem in distributed permutation flow shop problem with number of identical factories and machines. Different products must be distributed between the factories and then assignment of products to factories and sequencing of the products assigned to each factory has to be d...
متن کاملImproved genetic algorithm for the permutation flowshop scheduling problem
Genetic algorithms (GAs) are search heuristics used to solve global optimization problems in complex search spaces. We wish to show that the e6ciency of GAs in solving a &owshop problem can be improved signi7cantly by tailoring the various GA operators to suit the structure of the problem. The &owshop problem is one of scheduling jobs in an assembly line with the objective of minimizing the com...
متن کاملProblem Structure and Owshop Scheduling
Many algorithms leverage structure to solve problems. In owshop scheduling , we study two types of structure. First, for each job, we generate processing times that are similar across all machines (job-correlated problems). Then, for each machine, we generate processing times that are similar for all the jobs (machine-correlated problems). For these types of problems, we study the innu-ence of ...
متن کاملRestarted Iterated Pareto Greedy algorithm for multi-objective flowshop scheduling problems
Multi-objective optimisation problems have seen a large impulse in the last decades. Many new techniques for solving distinct variants of multi-objective problems have been proposed. Production scheduling, as with other operations management elds, is no di erent. The owshop problem is among the most widely studied scheduling settings. Recently, the Iterated Greedy methodology for solving the si...
متن کامل